Schedules for dynamic bidirectional simulations on parallel computers

نویسنده

  • Uwe Lehmann
چکیده

First of all, I would like to express my gratitude to Prof. Andreas Griewank for his guidance and supervision while working on this thesis. Furthermore, I would like to thank Prof. Wolfgang E. Nagel for giving me the opportunity to work on this subject and for all the support he has given me over the last five years. Special thanks are due to Dr. Andrea Walther for all of the helpful discussions we had and hints and support she gave me. Moreover, I am indebted to Rachel Lichten, John Shaw and Ellen Smith who helped me to bring this thesis into shape. Also, I thank all of my colleagues at the Centre for High Performance Computing for the nice and pleasant working atmosphere. On the nonmathematical side, I want to thank my parents very much for all of the lifelong support and help they have given me. Last but not least, my special thanks go to Catrin Lorenz for her patience, understanding and continuous support, without which I would not have been able to write this thesis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Angewandte Mathematik Und Informatik Universit at Zu K Oln Dynamic Load Balancing for Simulations of Biological Aging Dynamic Load Balancing for Simulations of Biological Aging

The eecient usage of parallel computers and workstation clusters for biologically motivated simulations depends rst of all on a dynamic redistribution of the workload. For the development of a parallel algorithm for the Penna model of aging we have used a dynamic load balancing library , called PLB. It turns out that PLB manages a nearly balanced load situation during runtime taking only a low ...

متن کامل

Efficiency of Dynamic Load Balancing Based on Permanent Cells for Parallel Molecular Dynamics Simulation

This paper addresses a dynamic load balancing method of domain decomposition for 3-dimensional Molecular Dynamics on parallel computers. In order to reduce interprocessor communication overhead, we are introducing a concept of permanent cells to the dynamic load balancing method. Molecular Dynamics simulations on a parallel computer T3E prove that the proposed method using load balancing much i...

متن کامل

بهینه سازی زمان بندی الگوریتم های موازی با استفاده از الگوریتم ژنتیک

In scheduling, a set of machines in parallel is a setting that is important, from both the theoretical and practical points of view. From the theoretical viewpoint, it is a generalization of the single machine scheduling problem. From the practical point of view the occurrence of resources in parallel is common in real-world. When machines are computers, a parallel program can be conceived as a...

متن کامل

Parallel Spatial Pyramid Match Kernel Algorithm for Object Recognition using a Cluster of Computers

This paper parallelizes the spatial pyramid match kernel (SPK) implementation. SPK is one of the most usable kernel methods, along with support vector machine classifier, with high accuracy in object recognition. MATLAB parallel computing toolbox has been used to parallelize SPK. In this implementation, MATLAB Message Passing Interface (MPI) functions and features included in the toolbox help u...

متن کامل

Dynamic Cape-open Simulation Approach on Cluster Oriented Architecture

Process simulations are more and more time consuming. One of the methods that allow reducing the computational time of an application is to distribute the workload onto several computers. In this paper, we present some techniques from parallel and distributed computing applied to CAPE-OPEN compliant dynamic process simulations. We have implemented a fully transparent easy-to-use prototype which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003